14 research outputs found
Square root computation over even extension fields
This paper presents a comprehensive study of the computation of square roots over finite extension fields. We propose two novel algorithms for computing square roots over even field extensions of the form \F_{q^{2}}, with an odd prime and . Both algorithms have an associate computational cost roughly equivalent to one exponentiation in \F_{q^{2}}. The first algorithm is devoted to the case when , whereas the second one handles the case when . Numerical comparisons show that the two algorithms presented in this paper are competitive and in some cases more efficient than the square root methods previously known
On Isogeny Graphs of Supersingular Elliptic Curves over Finite Fields
We study the isogeny graphs of supersingular elliptic curves over finite
fields, with an emphasis on the vertices corresponding to elliptic
curves of -invariant 0 and 1728
MinRank in the Head: Short Signatures from Zero-Knowledge Proofs
In recent years, many digital signature scheme proposals have been built from the so-called MPC-in-the-head paradigm. This has shown to be an outstanding way to design efficient signatures with security based on hard problems.
MinRank is an NP-complete problem extensively studied due to its applications to cryptanalysis since its introduction in 1999. However, only a few schemes base their security on its intractability, and their signature size is large compared with other proposals based on NP problems. This paper introduces the first MinRank-based digital signature scheme that uses the MPC-in-the-head, enabling it to achieve small signature sizes and running times. For NIST\u27s category I parameter set, we obtain signatures of 6.5KB, which is competitive with the shortest proposals in the literature that are based on non-structured problems
Computing Discrete Logarithms in F_{3^{6*137}} and F_{3^{6*163}} using Magma
We show that a Magma implementation of Joux\u27s L[1/4+o(1)] algorithm
can be used to compute discrete logarithms in the 1303-bit finite field
F_{3^{6*137}} and the 1551-bit finite field F_{3^{6*163}} with very modest computational resources. Our F_{3^{6*137}} implementation was the first to illustrate the effectiveness of
Joux\u27s algorithm for computing discrete logarithms in small-characteristic
finite fields that are not Kummer or twisted-Kummer extensions
Karatsuba-based square-root Vélu’s formulas applied to two isogeny-based protocols
At a combined computational expense of about field operations, VĂ©lu\u27s formulas are used to construct and evaluate degree- isogenies in the vast majority of isogeny-based cryptographic schemes. By adapting to VĂ©lu\u27s formulas a baby-step giant-step approach, Bernstein, De Feo, Leroux, and Smith presented a procedure that can computes isogeny operations at a reduced cost of just field operations. In this paper, we present a concrete computational analysis of these novel procedure along with several algorithmic tricks that helped us to further decrease its computational cost.
We also report an optimized Python3-code implementation of several instantiations of two isogeny-based key-exchange protocols, namely, CSIDH and B-SIDH. Our software library uses a combination of the modified VĂ©lu\u27s formulas and an adaptation of the optimal strategies commonly used in the SIDH/SIKE protocols to produce significant speedups.
Compared to a traditional VĂ©lu constant-time implementation of CSIDH, our experimental results report a saving of
5.357\%, 13.68\% and 25.938\% base field operations for CSIDH-512, CSIDH-1024, and CSIDH-1792, respectively.
Additionally, we present the first optimized implementation of B-SIDH ever reported in the open literature
Weakness of F_{3^{6*1429}} and F_{2^{4*3041}} for Discrete Logarithm Cryptography
In 2013, Joux and then Barbulsecu et al. presented new algorithms for computing discrete logarithms in finite fields of small characteristic. Shortly thereafter, Adj et al. presented a concrete analysis showing that, when combined with some steps from classical algorithms, the new algorithms render the finite field F_{3^{6*509}} weak for pairing-based cryptography. Granger and Zumbragel then presented a modification of the new algorithms that extends their effectiveness to a wider range of fields.
In this paper, we study the effectiveness of the new algorithms combined with a carefully crafted descent strategy for the fields F_{3^{6*1429}} and F_{2^{4*3041}}. The intractability of the discrete logarithm problem in these fields is necessary for the security of pairings derived from supersingular curves with embedding degree 6 and 4 defined, respectively, over F_{3^{1429}} and F_{2^{3041}}; these curves were believed to enjoy a security level of 192 bits against attacks by Coppersmith\u27s algorithm. Our analysis shows that these pairings offer security levels of at most 96 and 129 bits, respectively, leading us to conclude that they are dead for pairing-based cryptography
Faulty isogenies: a new kind of leakage
In SIDH and SIKE protocols, public keys are defined over quadratic extensions of prime fields.
We present in this work a projective invariant property characterizing affine Montgomery curves defined over prime fields.
We then force a secret 3-isogeny chain to repeatedly pass through a curve defined over a prime field in order to exploit the new property and inject zeros in the A-coefficient of an intermediate curve to successfully recover the isogeny chain one step at a time.
Our results introduce a new kind of fault attacks applicable to SIDH and SIKE
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head
Since 2016’s NIST call for standardization of post-quantum cryptographic primitives, developing efficient post-quantum secure digital signature schemes has become a highly active area of research. The difficulty in constructing such schemes is evidenced by NIST reopening the call in 2022 for digital signature schemes, because of missing diversity in existing proposals. In this work, we introduce the new post-quantum digital signature scheme MiRitH. As direct successor of a scheme recently developed by Adj, Rivera-Zamarripa and Verbel (Africacrypt ’23), it is based on the hardness of the MinRank problem and follows the MPC-in-the-Head paradigm. We revisit the initial proposal, incorporate design-level improvements and provide more efficient parameter sets. We also provide the missing justification for the quantum security of all parameter sets following NIST metrics. In this context we design a novel Grover-amplified quantum search algorithm for solving the MinRank problem that outperforms a naive quantum brute-force search for the solution.
MiRitH obtains signatures of size 5.7 kB for NIST category I security and therefore competes for the smallest signatures among any post-quantum signature following the MPCitH paradigm. At the same time MiRitH offers competitive signing and verification timings compared to the state of the art. To substantiate those claims we provide extensive implementations. This includes a reference implementation as well as optimized constant-time implementations for Intel processors (AVX2), and for the ARM (NEON) architecture. The speed-up of our optimized AVX2 implementation relies mostly on a redesign of the finite field arithmetic, improving over existing implementations as well as an improved memory management
Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
Since 2013 there have been several developments in algorithms for
computing discrete logarithms in small-characteristic finite fields,
culminating in a quasi-polynomial algorithm. In this paper, we
report on our successful computation of discrete logarithms in the
cryptographically-interesting characteristic-three finite field
using these new algorithms; prior to 2013, it was believed that this field enjoyed a security level of 128 bits. We also show that a recent
idea of Guillevic can be used to compute discrete logarithms in
the cryptographically-interesting finite field using essentially
the same resources as we expended on the computation. Finally,
we argue that discrete logarithms in the finite field can
feasibly be computed today; this is significant because this
cryptographically-interesting field was previously believed to
enjoy a security level of 192 bits